On the Relative Lengths of Sides of Convex Polygons
نویسنده
چکیده
Let C be a convex body. By the relative distance of points p and q we mean the ratio of the Euclidean distance of p and q to the half of the Euclidean length of a longest chord of C parallel to pq. The aim of the paper is to find upper bounds for the minimum of the relative lengths of the sides of convex hexagons and
منابع مشابه
Configuration spaces of convex and embedded polygons in the plane
A celebrated result of Connelly, Demaine, and Rote [6] states that any polygon in the plane can be “convexified.” That is, the polygon can be deformed in a continuous manner until it becomes convex, all the while preserving the lengths of the sides and without allowing the sides to intersect one another. In the language of topology, their argument shows that the configuration space of embedded ...
متن کاملOptimal Nearly-Similar Polygon Stabbers of Convex Polygons
A convex polygon that is nearly-similar to a model polygon P has sides parallel and in the same order to the corresponding sides of P. The lengths of the sides are unrestricted and may be zero. Given a set of target convex polygons in the plane with a total of n vertices, and a xed model convex stabbing polygon P, the minimum-perimeter polygon nearly-similar to P that stabs the targets can be f...
متن کاملOn the Moduli Space of Polygons in the Euclidean Plane
We study the topology of moduli spaces of polygons with xed side lengths in the Euclidean plane. We establish a duality between the spaces of marked Euclidean polygons with xed side lengths and marked convex Euclidean polygons with prescribed angles. 1. We consider the space P n of all polygons with n distinguished vertices in the Euclidean plane E 2 whose sides have nonnegative length allowing...
متن کاملSporadic Reinhardt Polygons
Let n be a positive integer, not a power of two. A Reinhardt polygon is a convex n-gon that is optimal in three different geometric optimization problems: it has maximal perimeter relative to its diameter, maximal width relative to its diameter, and maximal width relative to its perimeter. For almost all n, there are many Reinhardt polygons with n sides, and many of them exhibit a particular pe...
متن کاملArithmetic Polygons
We consider the question of the existence of equiangular polygons with edge lengths in arithmetic progression, and show that they do not exist when the number of sides is a power of two and do exist if it is any other even number. A few results for small odd numbers are given. An Olympiad problem [1] asked the following. Prove that there exists a convex 1990-gon with the following two propertie...
متن کامل